Towards a Semantic Characterization of Cut-Elimination
نویسندگان
چکیده
We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination. Our conditions are formulated both syntactically and semantically.
منابع مشابه
A Semantic Proof that Reducibility Candidates entail Cut Elimination
Two main lines have been adopted to prove the cut elimination theorem: the syntactic one, that studies the process of reducing cuts, and the semantic one, that consists in interpreting a sequent in some algebra and extracting from this interpretation a cut-free proof of this very sequent. A link between those two methods was exhibited by studying in a semantic way, syntactical tools that allow ...
متن کاملTowards a Contrastive Pragmatic Analysis of Congratulation Speech Act in Persian and English
This paper aims at studying the speech act of congratulation in Persian and English with regard to semantic formulas. To gather the semantic formulas related to congratulation, the researchers chose 100 movies (50 in Persian and 50 in English) as the instrument of the study. The only model of cross-cultural comparison was related to that of Elwood (2004). Therefore, we used Elwood’s model as th...
متن کاملFast Cut-Elimination by Projection
The transformation of arbitrary proofs in Gentzen’s calculus LK into cut-free proofs is of central importance not only to proof theory itself but also to computer science. Particularly the extraction of programs from proofs requires cutelimination as a preparatory step; the size of the resulting program then depends on that of the cut-free proof. This illustrates the relevance 1. of the design ...
متن کاملSemantic A-translation and Super-consistency entail Classical Cut Elimination
We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the intuitionistic sequent calculus modulo R. We first define a syntactic and a s...
متن کاملCut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomatisation of a particular logic and its coalgebraic semantics that guarantee that the cut-rule is admissible in the ensuing sequent calculus. We then independently isolate a purely syntactic property of the set of modal ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 82 شماره
صفحات -
تاریخ انتشار 2006